Simple Recognition of Halin Graphs and Their Generalizations
نویسندگان
چکیده
منابع مشابه
Simple Recognition of Halin Graphs and Their Generalizations
We describe and implement two local reduction rules that can be used to recognize Halin graphs in linear time, avoiding the complicated planarity testing step of previous linear time Halin graph recognition algorithms. The same two rules can be used as the basis for linear-time algorithms for other algorithmic problems on Halin graphs, including decomposing these graphs into a tree and a cycle,...
متن کاملBoxicity of Halin graphs
A k-dimensional box is the Cartesian product R1 × R2 × · · · ×Rk where each Ri is a closed interval on the real line. The boxicity of a graph G, denoted as box(G) is the minimum integer k such that G is the intersection graph of a collection of k-dimensional boxes. Halin graphs are the graphs formed by taking a tree with no degree 2 vertex and then connecting its leaves to form a cycle in such ...
متن کاملLinear Arrangement of Halin Graphs
We study the Optimal Linear Arrangement (OLA) problem of Halin graphs, one of the simplest classes of non-outerplanar graphs. We present several properties of OLA of general Halin graphs. We prove a lower bound on the cost of OLA of any Halin graph, and define classes of Halin graphs for which the cost of OLA matches this lower bound. We show for these classes of Halin graphs, OLA can be comput...
متن کاملStack and Queue Layouts of Halin Graphs
A Halin graph the union of a tree with no degree-2 vertices and a cycle on the leaves of the tree. This paper examines the problem of laying out Halin graphs using stacks and queues. A k-stack (k-queue) layout of a graph consists of a linear ordering of the vertices along with an assignment of each edge to one of k stacks (queues). The ordering and the edge assignments must be made such that if...
متن کاملDominating cycles in halin graphs
A cycle in a graph is dominating if every vertex lies at distance at most one from the cycle and a cycle is D-cycle if every edge is incident with a vertex of the cycle. In this paper, first we provide recursive formulae for finding a shortest dominating cycle in a Hahn graph; minor modifications can give formulae for finding a shortest D-cycle. Then, dominating cycles and D-cycles in a Halin g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2016
ISSN: 1526-1719
DOI: 10.7155/jgaa.00395